منابع مشابه
Combinatorial Optimization Model for Railway Engine Assignment Problem
This paper presents an experimental study for the Hungarian State Railway Company (MÁV). The engine assignment problem was solved at MÁV by their experts without using any explicit operations research tool. Furthermore, the operations research model was not known at the company. The goal of our project was to introduce and solve an operations research model for the engine assignment problem on ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملOn a Combinatorial Problem
Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...
متن کاملTruthful Combinatorial Assignment without Money
Mechanism design with agents who do not have quasi-linear preferences is an important line of research in social choice theory. Finding domains which admit truthful mechanisms is of central importance, particularly due to the well known impossibility result by Gibbard and Satterthwaite. In this paper we introduce a general framework for combinatorial assignments without money but with public va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1961
ISSN: 0028-0836,1476-4687
DOI: 10.1038/191100a0